Homomorphic Proofs and Applications
نویسندگان
چکیده
This paper introduces and formalizes homomorphic proofs,which allow ’adding’ proofs and ’adding’ their statementsto get a new proof of the ’sum’ statement. We proposea construction of homomorphic proofs and show one of itsapplications which is a new accumulator scheme with del-egatable non-membership (NM) proofs. We use this accu-mulator in extending the BCCKLS scheme [3] to achievea delegatable anonymous credential with revocation system.Informally, the accumulator’s delegatable NM proofs enableuser A, without revealing her identity, to delegate to userB the ability to prove that A’s identity is not included in ablacklist which could even be updated afterward. Moreover,the delegation should be redelegatable, unlinkable and ver-ifiable. Security of the proposed schemes is provable. Weimplement a system for Revocation of Anonymous Creden-tials (RAC ) that bases on the proposed accumulator. RACcould provide revocation for several anonymous credentialsystems.
منابع مشابه
Revocation for Delegatable Anonymous Credentials
This paper introduces and formalizes homomorphic proofs that allow ‘adding’ proofs and proof statements to get a new proof of the ‘sum’ statement. Additionally, we introduce a construction of homomorphic proofs, and show an accumulator scheme with delegatable non-membership proofs (ADNMP) as one of its applications with provable security. Finally, the proposed accumulator method extends the BCC...
متن کاملMinimizing Non-interactive Zero-Knowledge Proofs Using Fully Homomorphic Encryption
A non-interactive zero-knowledge proof can be used to demonstrate the truth of a statement without revealing anything else. It has been shown under standard cryptographic assumptions that non-interactive zero-knowledge proofs of membership exist for all languages in NP. However, known non-interactive zero-knowledge proofs of membership of NP-languages yield proofs that are larger than the corre...
متن کاملNon-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures
Verifiability is central to building protocols and systems with integrity. Initially, efficient methods employed the Fiat-Shamir heuristics. Since 2008, the Groth-Sahai techniques have been the most efficient in constructing non-interactive witness indistinguishable and zero-knowledge proofs for algebraic relations. For the important task of proving membership in linear subspaces, Jutla and Roy...
متن کاملVoting ( Excerpts of Chapter 3 )
4 Voting with Homomorphic Encryption 3 4.1 Zero-Knowledge Proofs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 4.2 Homomorphic Encryption . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 4.2.1 Homomorphic Encryption and Decryption . . . . . . . . . . . . . . . . . . . 4 4.2.2 Distributed Key Generation . . . . . . . . . . . . . . . . . . . . . . . . . . ...
متن کاملQuantum Fully Homomorphic Encryption with Verification
Fully-homomorphic encryption (FHE) enables computation on encrypted data while maintaining secrecy. Recent research has shown that such schemes exist even for quantum computation. Given the numerous applications of classical FHE (zero-knowledge proofs, secure two-party computation, obfuscation, etc.) it is reasonable to hope that quantum FHE (or QFHE) will lead to many new results in the quantu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011